Establishing domains of authority for routing table updates between routing devices in a fifth generation (5g) or other next generation network

ABSTRACT

The technologies described herein are generally directed toward establishing a domain of authority for routing table updates from a routing device. According to an embodiment, a system can comprise a processor and a memory that can enable operations facilitating performance of operations including identifying a route update that comprises information about a network. According to the embodiment, the operations can further include communicating, via the network, the route update to a second routing device for propagation of the route update to routing devices in a first authority domain with the first routing device.

RELATED APPLICATIONS

The subject patent application is a continuation of, and claims priorityto each of, U.S. patent application Ser. No. 17/355,363, filed Jun. 23,2021, and entitled “ESTABLISHING DOMAINS OF AUTHORITY FOR ROUTING TABLEUPDATES BETWEEN ROUTING DEVICES IN A FIFTH GENERATION (5G) OR OTHER NEXTGENERATION NETWORK,” which is a continuation of U.S. patent applicationSer. No. 16/804,568 (now U.S. Pat. No. 11,071,041), filed Feb. 28, 2020,and entitled “ESTABLISHING DOMAINS OF AUTHORITY FOR ROUTING TABLEUPDATES BETWEEN ROUTING DEVICES IN A FIFTH GENERATION (5G) OR OTHER NEXTGENERATION NETWORK,” the entireties of which priority applications arehereby incorporated by reference herein.

TECHNICAL FIELD

The subject application is related to computer networking, and, forexample, using a router to select network traffic routes in a fifthgeneration (5G) or other next generation network.

BACKGROUND

As networks continue to be expanded to handle larger amounts ofinformation, the need for rapid and efficient routing within networkscontinues to increase. This is especially true when existing networksare used to carry larger traffic before hardware capabilities have beenincreased.

With traditional routing strategies, routing devices can receive routinginformation from other, different routing devices, with continualhardware upgrades matching increases in network use. With recentdramatic increases in demand for network bandwidth however, in somecircumstances, even traditional hardware upgrades can be renderedineffective. For example, in some circumstances, because of increases innetwork capacity requirements, the content, amount, and frequency ofupdates to routing information shared between routing devices can failto sufficiently model network conditions.

BRIEF DESCRIPTION OF THE DRAWINGS

The technology described herein is illustrated by way of example and notlimited in the accompanying figures in which like reference numeralsindicate similar elements and in which:

FIG. 1 is an architecture diagram of an example system that canfacilitate establishing a domain of authority for routing table updatesfrom a routing device, in accordance with one or more embodiments.

FIG. 2 depicts a diagram of an example network having routers withauthority domains for shared routing table updates, in accordance withone or more embodiments.

FIG. 3 depicts a diagram of an example network having routers withauthority domains for shared routing table updates, in accordance withone or more embodiments.

FIG. 4 illustrates an example node diagram of a network with componentsthat can facilitate establishing a domain of authority for routing tableupdates from a routing device, in accordance with one or moreembodiments.

FIG. 5 illustrates another example node diagram of a network that canfacilitate establishing a domain of authority for routing table updatesfrom a routing device, in accordance with one or more embodiments.

FIG. 6 depicts a process whereby the above described processes candefine authority domains with TTL limits on route updates and evaluationby routers receiving the updates, in accordance with one or moreembodiments.

FIG. 7 is a flow diagram representing example operations of an examplesystem that can facilitate establishing a domain of authority forrouting table updates from a routing device, in accordance with one ormore embodiments.

FIG. 8 illustrates a flow diagram of an example method that canfacilitate establishing a domain of authority for routing table updatesfrom a routing device, in accordance with one or more embodiments.

FIG. 9 illustrates an example block diagram of a mobile handset operableto engage in a system architecture that facilitates wirelesscommunications according to one or more embodiments described herein.

FIG. 10 illustrates an example block diagram of an example computeroperable to engage in a system architecture that can facilitateprocesses described herein, in accordance with one or more embodiments.

DETAILED DESCRIPTION

Generally speaking, one or more embodiments can provide improved routingamong multiple routing devices, in fifth generation (5G) or other nextgeneration networks. In some implementations, one or more embodimentscan facilitate establishing a relativistic routing approach thatfrequently identifies and distributes among routers, useful informationabout network conditions, e.g., to facilitate improved routing amongmultiple devices.

In addition, one or more embodiments described herein can be directedtowards a multi-connectivity framework that supports the operation ofNew Radio (NR, sometimes referred to as fifth generation (5G)). As willbe understood, one or more embodiments can allow an integration of userequipment (UEs) with network assistance, by supporting control andmobility functionality on cellular links (e.g. LTE or NR). One or moreembodiments can provide benefits including, system robustness, reducedoverhead, and global resource management, while facilitating directcommunication links via a NR sidelink.

In some embodiments, the non-limiting term “radio network node” orsimply “network node,” “radio network device or simply “network device”are used herein. These terms may be used interchangeably, and refer toany type of network node that can serve user equipment and/or beconnected to other network node or network element or any radio nodefrom where user equipment receives signal. Examples of radio networknodes are Node B, base station (BS), multi-standard radio (MSR) nodesuch as MSR BS, gNodeB, eNode B, network controller, radio networkcontroller (RNC), base station controller (BSC), relay, donor nodecontrolling relay, base transceiver station (BTS), access point (AP),transmission points, transmission nodes, RRU, RRH, nodes in distributedantenna system (DAS), etc. As noted above, some embodiments aredescribed in particular for 5G new radio systems. The embodiments arehowever applicable to any radio access technology (RAT) or multi-RATsystem where the user equipment operates using control signals, e.g. LTEFDD/TDD, WCMDA/HSPA, GSM/GERAN, Wi Fi, WLAN, WiMax, CDMA2000, etc.

In some embodiments, the non-limiting term router, routing device, orrouter device is used. This term can refer to any type of electronicdevice that can facilitate the connection of one or more nodes to anetwork, and between two or more nodes in the network, e.g., including,but not limited to, a general computer that has been configured toperform network routing functions. It should further be noted that, oneor more embodiments used in examples herein utilize routers that employan approach to network connectivity that is based on minimizing delay ofnetworked communications by employing large numbers of route updatesthroughout the network, e.g., minimizing delay in a network route bymaking available frequently updated information about the network routes(e.g., route information and route updates discussed below) for use inplanning network routes, e.g., link transmission speed, and delays.

One approach to implementing embodiments of this delay-minimizingapproach that can use frequently generated route updates shared betweenrouters. As described below, in one or more embodiments, routers canreceive the route updates, rapidly process the route updates, using theprocessed route updates to direct or redirect network traffic to routesthat can reduce delays. In addition, received route updates can bewidely propagated to other networked devices. One aspect of thisapproach to routing is that it can utilize a router to process millionsof route updates per second, with this level of route processing beingimproved by one or more of the embodiments described herein.

In one or more embodiments, as discussed further below, with routeupdates being rapidly and extensively propagated from router to router,the overhead of such an approach can be considered, along with increasesin routing success that can be achieved by the approach. Further,notwithstanding the relationship between embodiments of this networkrouting approach and embodiments of frequent and extensive route updatesused by routers described herein, some combinations of featuresdescribed in one or more embodiments, and recited in the claims below,can be applied to other approaches to network routing beyond approachesdescribed in one or more of the examples used herein.

In example approaches to routing that can beneficially employ one ormore embodiments, routing devices can establish domains of authoritywhere other networked routing devices can be affected by routing updatesdistributed by the routing devices. Because, in some implementations,routing updates can be rapidly propagated to other routing devices,useful results can be achieved by using one or more embodiments to limitthis propagation of route updates.

It should be noted that, but facilitating the determination of whetherto propagate route updates to individual routers, one or moreembodiments can establish a system of distributed decision-making forrouting devices of a network. Stated differently, in one or moreembodiments, each router node can have a different area in which it hasthe best information (e.g., an authority domain), creating an area witha higher likelihood of optimization around each node. With thisapproach, networks can be composed of overlapping areas centered on thenodes. By frequently and extensively sharing routing information,together, the nodes can improve the likelihood of selecting the bestpath for a packet as it traverses the network in a distributed fashion.In some circumstances, because information exchanged between router canbe delayed, the likelihood of optimization can improve the closer thepacket gets to its destination.

FIG. 1 is an architecture diagram of an example system 100 that canfacilitate establishing a domain of authority for routing table updatesfrom a routing device, in accordance with one or more embodiments. Forpurposes of brevity, description of some elements and/or processes ofembodiments discussed further below are omitted in this discussion ofFIG. 1 . System 100 can include first device 150 connected via network190 to second device 180. First device 150 can includecomputer-executable components 120, processor 160, route updateprocessor 140, storage 170, and memory 165. Computer-executablecomponents 120 can include route update identifying component 125, routeupdate evaluating component 126, routing table updating component 128,route update flooding component 129, and other computer-executablecomponents 120 that can be used to implement aspects of system 100, asdescribed herein. Examples of computer executable components includeapplications 1032 and modules 1034 of FIG. 10 discussed below.

In some embodiments, memory 165 can comprise volatile memory (e.g.,random access memory (RAM), static RAM (SRAM), dynamic RAM (DRAM), etc.)that can employ one or more memory architectures. Further examples ofmemory 165 are described below with reference to system memory 1006 ofFIG. 10 discussed below. In some embodiments, storage 170 can comprisenon-volatile memory (e.g., read only memory (ROM), programmable ROM(PROM), electrically programmable ROM (EPROM), electrically erasableprogrammable ROM (EEPROM), etc.) that can employ one or more storagearchitectures. Such examples of memory 165 and storage 170 can beemployed to implement any embodiments of the subject disclosuredescribed or suggested by disclosures herein.

According to multiple embodiments, processor 160 can comprise one ormore processors and/or electronic circuitry that can implement one ormore computer and/or machine readable, writable, and/or executablecomponents and/or instructions that can be stored using memory 165 andstorage 170. For example, processor 160 can perform various operationsthat can be specified by such computer and/or machine readable,writable, and/or executable components and/or instructions including,but not limited to, logic, control, input/output (I/O), arithmetic,and/or the like. In some embodiments, processor 160 can comprise one ormore central processing unit, multi-core processor, microprocessor, dualmicroprocessors, microcontroller, System on a Chip (SOC), arrayprocessor, vector processor, and/or another type of processor. Furtherexamples of processor 160 are described below with reference toprocessor 1002 of FIG. 10 below, and processing unit 1004 of FIG. 10discussed below. Such examples of processor 160 can be employed toimplement any embodiments of the subject disclosure.

It should be noted that, in the example of FIG. 1 , and throughout thisdisclosure, route update processor 140 is listed separately fromprocessor 160, and this is because route updates 182 (as well as otherrouting information, such as routing table 175) can, in one or moreembodiments, be advantageously generated, processed, and modified bydifferent types of processors, e.g., specialized route update processorsand other co-processing components. Different reasons why this is doneby some implementations are discussed further below with FIGS. 2-5 ,e.g., because, as described further below, of the volume of routeupdates 182 that can be generated, processed and used by one or moreembodiments to rapidly select network routes and change network routing.In this example, the route update processor 140 can generate, process,and utilize the route updates (e.g., with extensive processing), whilethe processor 160 can use much less processing power to utilize thegenerated information, e.g., routing table 175 and route updates 182. Asfurther discussed below, route update evaluating component 126 canprovide a pre-processing assessment of route updates that can reduce theamount of processing that is performed by route update processor 140. Inone or more embodiments, route update processor can be a graphicsprocessing unit, or other co-processor configured to perform parallelprocessing operations.

Generally, applications (e.g., computer-executable components 120) caninclude routines, programs, components, data structures, etc., thatperform particular tasks or implement particular abstract data types.Moreover, those skilled in the art will appreciate that the methodsdescribed herein can be practiced with other system configurations,including single-processor or multiprocessor systems, minicomputers,mainframe computers, as well as personal computers, hand-held computingdevices, microprocessor-based or programmable consumer electronics, andthe like, each of which can be operatively coupled to one or moreassociated devices.

It should be appreciated that the embodiments of the subject disclosuredepicted in various figures disclosed herein are for illustration only,and as such, the architecture of such embodiments are not limited to thesystems, devices, and/or components depicted therein. For example, insome embodiments, first device 150 can further comprise various computerand/or computing-based elements described herein with reference tooperating environment 1000 and FIG. 10 . In one or more embodiments,such computer and/or computing-based elements can be used in connectionwith implementing one or more of the systems, devices, components,and/or computer-implemented operations shown and described in connectionwith FIG. 1 or other figures disclosed herein.

As described further below, in one or more embodiments, memory 165 canstore executable instructions that, when executed by the processor canfacilitate performance of operations that can implement one or moreembodiments described herein. For example, in one or more embodiments,the operations can implement route update identifying component 125 thatcan facilitate receiving a route update for routing table 175 of firstdevice 150 communicated via network 190 by second device 180, with theroute update being associated with different aspects of network 190,e.g., a route to a network destination. Examples of routes and routeupdates are included with the discussion of FIG. 3-4 below. Inalternative embodiments, operations can implement route updateidentifying component 125 that can facilitate identifying, by firstdevice 150, a route update 182 by detecting, by the first routingdevice, route information corresponding to route update 182. It shouldbe appreciated that route information that can be used by one or moreembodiments is not limited examples described herein, but can be anyinformation relevant to network 190 routing, at the current time and inthe future.

In one or more embodiments, memory 165 can further store executableinstructions that, when executed by the processor can facilitateperformance of operations that can implement route update evaluatingcomponent 126. In one or more embodiments, route update evaluatingcomponent 126 can evaluate a value of route update 182, resulting in anevaluated value of the route update. As described throughout thisdisclosure, in one or more embodiments, the value of route update 182can describe the usefulness of the route update for efficiently routingnetwork traffic.

In one or more embodiments memory 165 can further store executableinstructions that, when executed by the processor can facilitateperformance of operations that can implement route routing tableupdating component 128. In one or more embodiments, routing tableupdating component 128 can, as discussed further below, update an entryof routing table 175 based on route update 175 and the evaluated valueof route update 182, e.g., by route update evaluating component 128.

In one or more embodiments memory 165 can further store executableinstructions that, when executed by the processor can facilitateperformance of operations that can implement route routing tableflooding component 129. In one or more embodiments, routing tableflooding component 129 can, as discussed further below, selectivelypropagate route updates to other routing devices throughout network 190.Some embodiments can use a flooding protocol to distribute route updatesbecause, as described further herein, with some exceptions, changes inrouting information identified by routers (e.g., route updates) can beimmediately propagated (e.g., using a flooding control protocol) toadjacent nodes, with these nodes in some cases discussed below, furtherflooding the updated information to adjacent nodes.

FIG. 2 depicts a diagram of an example network 200 having routers withauthority domains for shared routing table updates, in accordance withone or more embodiments. For purposes of brevity, description of likeelements and/or processes employed in other embodiments is omitted.Network 200 includes authority domains 250A-B with various routers210A-E included in one or both authority domains 250A-B. Authoritydomain 250A includes routers 210E and 210D, authority domain 250Bincludes routers 210A-B, router 210C is included in both domains 250A-B.Asynchronous links 275A-E are depicted as coupling various routers210A-E.

In one or more embodiments, network 200 is, as described above, anetwork that can exchange routing information between routers 210A-E forvarious reasons, e.g., to maintain routing tables local to each routerfor use selecting from available routers when forwarding communications(e.g., packets) toward a destination router. In one or more embodiments,route update information can be collected, analyzed, and communicated toconnected routers at very short intervals, e.g., in someimplementations, as frequently as 10 ms. In an approach that can be usedby one or more embodiments to make this frequent updating approach lessprocessing intensive, one or more embodiments can limit the distributionof route updates in different ways. The example network 200 is used toillustrate the definition of authority domains 250A-B, and describe thedifferent types of links that can be maintained between routing devices,e.g., synchronous links 275A-E, and asynchronous link 278.

Generally speaking, in one or more updates, route updates can be valued(e.g., assigned an authority value based on the age of the information,e.g., older updates can have less authority because they have a higherlikelihood of less accurately reflecting the present status of networkcomponents on which they report. Stated differently, upon receipt byrouter, the estimated value of a route update can be inverselyproportional to the time since the information for the route update wascollected. Thus, in one or more embodiments, to improve the accuracy ofdistributed route updates, the extensive generation and propagation ofroute updates can be strategically limited by time, e.g., because routeupdates that are too old can be less accurate. In addition, by limitingthe time that route updates can be propagated, one or more embodimentscan limit the physical distance from the source that a route update cantravel, e.g., the distance that a signal can travel during the limitedtime available, as currently defined by the speed of light (c). Anauthority value of routing information can be generated by differentapproaches, with examples being discussed further with FIGS. 4 and 5below.

Reasons the physical limits to the propagation of route updates can beadvantageous to the operation of some embodiments is that route updatesgenerated by parts of a network that are distant (e.g., take longer toarrive than closer sources) to a router can, in addition to being old,have less applicability to the part of the network that is local to arouter. In one or more embodiments, limits imposed on the exchange routeinformation within and between authority domains can, in differentimplementations, advantageously balance the profusion of usefulinformation collected and exchanged with a potential for informationprocessing overload at network routers.

In one or more embodiments, a time limit for propagation of a routeupdate can be termed the time to live (TTL) of the route update, e.g.,route updates can continue to be forwarded and evaluated, and until thetime to live (TTL) of the information is exceeded, that is, a particularamount of time elapses since the route update was generated, or theroute updates a forwarded a certain number of times, with each forwardto a new routing device also being termed a hop. This follows a generalprinciple of one or more embodiments, this being that the usefulness ofinformation can be discounted by the age of the information, thisdiscount being for reasons including, but not limited to, the older theinformation is, the higher the likelihood it is no longer accurate tosome degree. The use of TTL limit by one or more embodiments for avariety of reasons is described further in FIGS. 2-5 below, e.g.,including in a formula to determine an authority value for a routeupdate.

As further discussed below, the processing and use of route updatesreceived by a router can also be limited based on information alreadyavailable to the router, e.g., newer or older versions of the sameinformation stored in routing table 175. In this process, as discussedfurther below, when a route update is received about a particular aspectof network 190 (e.g., a measure of delay to a destination router),routing table 175 local to the router can be queried, and if the routeupdate information has a higher determined authority that a determinedauthority for the information currently in routing table 175, theinformation in the routing table can be replaced with the moreauthoritative route update information received.

As discussed further below, because on a network, the age of an updatecan reflect the distance from a source of the update, defining a maximumtime an update can travel (e.g., TTL), can in effect define a size of adomain that can be influenced by the route update, e.g., the area(domain) upon which router that generated the route update has authority(the authority domain.) Stated differently, by limiting the time ofpropagation of a route update, an authoritative domain can be createdaround the router that generates the route update, e.g., because routersof the network can be configured to, once route updates exceed aparticular TTL age, stop forwarding the route updates to other routers.Based upon different limited to propagation discussed and suggestedherein, routers configured to operate with different embodiments herein(e.g., capable of handling large amounts of frequent updates) can, insome circumstances work similar to legacy routers, e.g., with routingtables updated with less information and less frequently.

Based on the approaches described and suggested herein, can delivernetwork delay comparable to that of point to point fiber, andperformance better and more responsive than existing a wide area network(WAN) routing protocols. For example, of the four elements of packetdelay, two can predominate in high speed networks: propagation delay andqueuing delay. Propagation delay can be predetermined by the speed oflight in fiber, queuing delay can be reduced, in one more embodiments byusing small queues that are able to be traversed in short periods oftime, e.g., 250 μsec. Part of the management of the small queues thatcan be utilized by one or more embodiments, is the generation of a routeupdate for other routers whenever a queue changed in an increment ofdelay, e.g., adjacent routers can be notified for every 50 μsec changein the delay of queue, with these notifications, turn, being subject topropagation to other routers.

In an example based on the embodiment depicted in FIG. 2 , router 210Acan identify information about network 200, e.g., information relevantto routing information within network 200, such as queueing delays,transit times between routers, etc. Different approaches to identifyingrouting information are discussed below with network arrangementsdepicted in FIGS. 4-5 . Continuing the example of FIG. 2 , uponidentification of the route information, router 210A can determinewhether to update a local routing table 175, and generate a route update182 for propagation to other network devices.

In one or more embodiments, route updates can be propagated to directlyconnected routing devices when identified, e.g., asynchronously, not bytime but by the information discovery triggering event. Different eventsthat can trigger asynchronous updates are discussed further herein. Inother circumstances, routing updates can be propagated at regularintervals (e.g., synchronously) with connected routing devices. In anexample implementation, this interval can 10 μsec. One having skill inthe relevant art(s), given the description herein, would appreciate thatthis approach, with asynchronous and synchronous updates in differentcircumstances, can be used by on one or more embodiments both to rapidlyshare important information (e.g., asynchronous updates), and alsoassure that updates are propagated frequently, even when no triggeringevent occurs, e.g., synchronous updates.

In this example, a route update can be propagated from router 210A todirectly-connected routers 210B-C, e.g., by route update floodingcomponent 129 using a flooding protocol to propagate the route update.In this example, router 210A is depicted as centrally located withinauthority domain 250B, this being because authority domain 250B isdefined by the influence of route updates communicated from router 210A,e.g., route updates can only travel a particular distance from router210A in time defined by some embodiments, and beyond this distance,router 210A does not have authority with other routing devices.

In this example, the generated route update can reach routers 210B-C,e.g., because of the propagation time specified by one or moreembodiments, and the length of the links between router 210A and routers210B-C. In additional embodiments, in routing table 175 of router 210A,an entry exists that lists routers 210D-E and taking longer for receiptthan remains in the time limit for propagation of the route update,e.g., in contrast to the propagation to routers 210B-C discussed above.It should be noted that, direct link 275B links router 210A to router210E, while router 210D is linked by links 275C-D via router 210C.

It is illustrative of the definition of domains by one or moreembodiments that router 210C is within authority domain 250B, whilerouter 210D is not within authority domain 250B. This limit of theextent of authority domain 250B can be enforced, for example, by router210C checking the propagation time limit of the route update uponreceipt of the route update from router 210A, and, because nopropagation time remains, the route update is not forwarded to router210D, e.g., the information generated by router 210A is not, in thisexample, influencing (e.g., with authority) the routing informationutilized by router 210D for routing.

FIG. 3 depicts a diagram of an example network 300 having routers withauthority domains for shared routing table updates, in accordance withone or more embodiments. For purposes of brevity, description of likeelements and/or processes employed in other embodiments is omitted.Network 300 includes authority domains 350A-B with routers 310A-Bincluded respectively therein.

In an example based on FIG. 3 , routers 310A-B are part of network 300,but are positioned at a distance such that a route update communicatedby router 310B cannot reach router 310A within the TTL time limitspecified by one or more embodiments. As noted above, because of this,routers 310A-B are set to be in different authority domains 350A-B.

In keeping with approaches used by one or more embodiments to distributeuseful routing information throughout network 300, in someimplementations router 310B can share routing updates with router 310A,outside of authority domain 350B. In one or more embodiments, routerscan be configured to propagate a route update for one hop when the TTLof the route update first becomes negative. This configuration can, insome implementations, facilitate the operation of routers 310B and 390in an approach that routes on delay for distance, not solely based onTTL authority.

In an example depicted in FIG. 3 , a route update originating at router310B is propagated 378A to router 390 near the end of the TTL of theroute update. When the TTL goes negative on the route update, router 390can be configured to propagate 378B the update to connected routingdevices, e.g., router 310A. As discussed further with FIGS. 4 and 6below, in one or more embodiments, when a router (e.g., router 310A)receives a route update that is negative, the router can be configuredto use the information to potentially update a local routing table(e.g., as discussed herein, compare current negative authority of updatewith calculated authority of information currently in routing table),but the routing update is not propagated because the TTL is negativeupon receipt by router 310A. Thus, router 390 propagates 378B the routeupdate for one hop and not further, and router 310B can extend authoritybeyond authority domain 350B, in some circumstances.

FIG. 4 illustrates an example node diagram of a network with componentsthat can facilitate establishing a domain of authority for routing tableupdates from a routing device, in accordance with one or moreembodiments. For purposes of brevity, description of like elementsand/or processes employed in other embodiments is omitted.

Network 400 includes source router 420, destination router 470, routers430A-430E, and links 460A-H between variously depicted nodes. One havingskill in the relevant art(s), given the description herein willappreciate that FIG. 4 depicts elements of an additional network routingexample. In this example, packets traveling from source router 430 todestination router 470 pass through ones of routers 430A-430E along aroute. Source router 420, and path routers 430A, 430C, and 430E are inauthority domain 480. Example routes 450A-450D are listed on FIG. 4 ,and include example routes from source router 420 to destination router470. A route update 490 is depicted being forwarded from router 430A.One having skill in the relevant art(s), given the description hereinwill appreciate that FIG. 4 depicts elements that can be used toillustrate different approaches to routing traffic in network 400.

In one or more embodiments, routers as depicted (e.g., 420, 430A-E, and470) can receive and send packets of information to connected routers inaccordance with a selected path towards a destination router 470, e.g.,utilizing TCP/IP routing. One having skill in the relevant art(s), giventhe description herein, would appreciate that one approach that can beused by routers to improve the selection, for packet relay, fromavailable routers is the use of a routing table 175, local to eachrouter 430A-E. This routing table 175 can collect known informationabout network links along different paths, and facilitate the selectionof the next router. For example, if source router 420 has information ina routing table 175 that corresponds to a problem with link 460B, analgorithm that selects from routers 430A and 430C can select router 430Cbecause this problem is avoided.

In one or more embodiments, different ways can be used to populaterespective routing tables 175 of routers with information about networklinks. One way to determine this information is by pinging adjacentnodes to test the round trip speed of a data packet. This informationwhen gathered can be compared to information already stored in therouting table 175 of the pinging router, and if the information isdetermined to be useful, it can be stored in the routing table for useby the pinging node.

In an example, source router 420 can ping both routers 430A and 430C,and store the results of these pings in a routing table 175 for userouting received packets, e.g., as a determined delay between sourcerouter 420 and each of routers 430A and 430C. In an example, asdescribed with FIG. 2 above, based on an event (e.g., the identificationof the noted delays) can trigger the propagation of this information inan asynchronous update to directly connected path routers 430A-C.

In this example, when route update 490A reaches path router, the TTL ofthe route update can be reduced by the travel time over link 460A. Asdescribed with FIG. 5 below, one approach for path router 430A toquickly evaluate the TTL of route update 490A is for source router 420,when it sends route update 490A to path router 430A, to estimate whatthe TTL will be upon receipt by path router 430A, and include thisestimate in route update 490A. This estimate can be immediately used bypath router 430A to determine the authority of the information of theroute update (e.g., for updating it local routing table 175) and fordetermining whether to forward route update 490A to path router 430B. Inthe example depicted in FIG. 4 , by the time route update 490A arrivesat path router 430B from source router 420, the TTL can be negative,e.g., in this implementation, it has been counted down from the initialvalue, reached zero, then continued to count down into the negative.

It is important to note that, in one or more embodiments, exceeding theTTL of a route update can restrict the propagation of the route update,but not the use of the route update by the receiving path router 430A.For example, upon receipt of the route update 490, source router 420 candetermine that this information should be stored in its local routingtable 175 for use, e.g., by evaluating the value of the information(e.g., with lower delays evaluated as having higher value), discountedby the age of the information (e.g., by the time to live (TTL) value ofthe route update, as discussed herein). If determined as valuable andstored in routing table 175, in one or more embodiments, the informationdetermined by source router 420, can be stored in routing table 175 ofpath router 430A. One having skill in the relevant art(s) willappreciate that other information can be stored in routing table 175without departing from the spirit of embodiments described herein. Thus,it should further be appreciated that, in some embodiments, even thoughthe negative authority value does not prevent the update of routingtable 175, the low authority value that comes from the negative TTLvalue can cause the information to have less authority than theinformation of routing table 175.

In an example that can be illustrated with network 400 of FIG. 4 , routeinformation can be identified by source router 420 that can providerouting information about a route between source router 420 anddestination router 470. In FIG. 4 , three routes are identified, two ofwhich utilize link 460E, between path router 430D and destination router470. In this example, the routing information is that link 460E istemporarily unavailable for use. This information can be identified bysource router 420 in a variety of ways, including, but not limited to,receiving it from another node (e.g., path router 430D can discover thisinformation about an immediate link 460E) and relay this route update490 via router 430A-E to source router 420. In another example,destination router 470 can detect the malfunctioning link 460E and sendroute update 490 to path router 430E, where this route update can befurther forwarded to path router 430C and source router 420. Other waysthis information can be identified by source router 420 includedetection of this unavailable link 460E, by source router 420, during aperiodic ping of the route to destination router 470, this process ofpinging being discussed further with FIG. 4 below.

FIG. 5 illustrates another example node diagram of a network 500 thatcan facilitate establishing a domain of authority for routing tableupdates from a routing device, in accordance with one or moreembodiments. For purposes of brevity, description of like elementsand/or processes employed in other embodiments is omitted.

Network 500 includes source router 530D, destination router 530E,routers 530A-530E, links 580A-G from source router 530D to destinationrouter 530E, and inbound links 585A-E from destination router 530E tosource router 530D. FIG. 5 can be used to illustrate differentapproaches that can be used by source router 530D to maintain routingtable 175 and select between route 550A, from source router 530D torouters 530A-B, then to destination router 530E, and route 550B, fromsource router 530D to router 530C, then to destination router 530E, withdestination router 530E being communicatively coupled to destinationnode 575.

As discussed above with network 400, in one or more embodiments, routers530A-E can determine information about network route information, updatea routing table, and share these updates with other nodes. It should benoted that, in example implementations, routing tables can be updated upto 500,000 times per second with current delay information determinedfrom testing and from nearby nodes. As noted below, with someexceptions, any change in routing information identified by routers530A-E are immediately propagated (e.g., using a flooding controlprotocol) to adjacent nodes, these nodes in some cases discussed below,further flooding the updated information to adjacent nodes.

In an example depicted in FIG. 5 , router 530D, coupled to source node525, can maintain routing table 175 based on information received byroute update identifying component 125, from adjacent routers 530A and530C about the operation of network 500. One having skill in therelevant art(s), given the description herein will appreciate othermeasures of network 500 operation, beyond the ones of this example, thatcan affect the maintenance of routing table 175.

As discussed further below, when considering the processing performed byroute update processor 140 by one or more embodiments, it should benoted that, like the rapid and extensive propagation of route update590A by router 530A, generally speaking, upon receipt and afterprocessing, source router 530D can be configured to send out routeupdate 590A to all adjacent routers, e.g., router 530C.

In one or more embodiments, because of the extensive generation andpropagation of route updates 590A by routers 530A-E, the frequency ofroute updates 590A-B received by routers 530A-E can cause route updateprocessing loads that exceed the capacity of available processingresources. With respect to the example routing tables being updated upto 500,000 times per second with current delay information noted above,by some estimations, processing capability of over a 100×10¹² floatingpoint operations per second (100 teraFLOPS) can be required, potentiallyexceeding the processing capacity of a Central Processing Unit (CPU). Asnoted above, one approach that can be employed by one or moreembodiments is to have specialized processing resources dedicated toprocessing route updates 590A, e.g., one or more route update processors140.

In one or more embodiments, additional approaches can be employed thatcan reduce the likelihood that the processing capacity of one or moreroute update processors 140 will be exceeded by the processing ofreceived route updates 590A. In an example system with frequent routeupdates being exchanged between routers, as well as frequent updates torouting tables 175, even with one or more dedicated and specializedroute update processors 140, the route processing capacity of individualrouters 530A-E can be insufficient to process and utilize the routinginformation available for use. In a further illustration of the routeinformation processed by one or more embodiments, different processingtasks that can be performed by one or more embodiments are discussedfurther with FIG. 4 below. As discussed further below, one or moreembodiments can reduce the route update processing load of routers530A-E without reducing the quality of route data available for use forrouting in routing table 175.

For example, to reduce the likelihood that the processing capacity ofone or more route update processors 140 will be exceeded by theprocessing of received route updates 590A-B, one or more embodiments canemploy features designed to reduce the number of route updates that arepropagated from a router once received by the router. Thus, in somecircumstances, route updates 590A-B are propagated to all adjacent nodeswithout analysis and with little restriction, and in othercircumstances, this propagation is cut off, e.g., after the route updateis too old to likely be useful.

One approach is to limit routing information propagated to adjacentrouters based on different criteria. For example, network informationidentified by a router 530A-E can cause the generation and propagationof a route update 590A-B when a predicted utility of the routinginformation exceeds a threshold, e.g., a queuing delay at a node exceedsa value, or the bits per second of a network link 580A-G falls below aparticular value. Other non-limiting, example approaches for predictingutility are discussed below, and with the discussion of FIG. 5 .

As discussed further below, another way that the processing loads can bereduced for receiving routers 530A-E, is for the receiving nodes toperform as assessment of the route update upon receipt, before a moresophisticated level of processing is performed by route update processor140. In one or more embodiments, this assessment can be a rapidoperation that can determine the quality of the route updateinformation, e.g., the comparison of a one or more metrics that canindicate quality to a threshold.

In one or more embodiments, the countdown of the TTL value for routeupdate 590A can be commenced and decremented is different ways.Returning to the example above, upon identification of the routinginformation, router 530A can note a time. When generating route update590A, in this example, to further remove processing tasks from router530D, router 530A can precalculate what the TTL will be at the time ofreceipt by router 530D. In one or more embodiments, this can beperformed based on a measurement by router 530A of values that include,but are not limited to, the control transmission queue delay for router530A (e.g., the route update may have to wait for transmission) and thetransmission time across link 580A, e.g., this value being collected(e.g., via a ping of router 530D) and stored for use in routing table175. One having skill in the relevant art(s), given the descriptionherein, will appreciate that other approaches can be used to manage theTTL of route updates 590A-B, in accordance with one or more embodiments.

Considering one effect of TTL in the operation of embodiments, in somecircumstances, assessed route information quality can incorporate adiscount in the quality of the information based on the age of theinformation, e.g., as time passes after the identification of routinginformation, the accuracy of the identified information can decline as adescription of particular network conditions at a particular link. Inone or more embodiments, older information can still provide usefulinformation, but the use of the information takes potential inaccuraciesinto account in different ways. As discussed further below, one approachto this, used by this example, assigns a time to live (TTL) value toroute update information, e.g., the route update is only propagated toadjacent routers for a particular duration. By stopping propagation ofroute update 530A-B, the further spread of this information can belimited. Assigning this value also, in one or more embodiments, can havethe effect of limiting the influence of a router in both time and space.For this example, a 250 μsec TTL is used, but one having skill in therelevant art(s), given the description herein, would appreciate thatother TTL durations can be selected, with different results.

Further, in one or more embodiments, the authority of individual routers530A-E can be limited in time because of the TTL applied to routeinformation identified by respective routers, and limited in space basedon physical limits, e.g., the speed of light can limit the propagationof any information to approximately 46 miles per 250 μsec TTL, and thepropagation medium can slow this down further. For example, in someimplementations, the maximum propagation speed for a route update is ⅔the speed of light, e.g., approximately 31 miles in fiber-optic cable.Thus, in this example, with links 580D and 580E being implemented withfiber-optic cable, a route update 590B generated by router 530D wouldnot reach router 530E if the distance of link 580D exceeds 31 miles,e.g., by the time route update 590B reaches router 530C, the 250 μsecTTL for route update 590B has expired, and, while route update 590B canbe utilized by router 530C, router 530C does not propagate route update590B to router 530E.

As noted above, in one or more embodiments, TTL can be used to limit thepropagation of route updates 590A-B, e.g., based on a geographicaldistance limit that comes from signal propagation. Further, as notedabove, one or more embodiments can perform a quick assessment, e.g.,comparing values of a route update to a threshold. In an exampleembodiments, these two concepts can be combined such that the only valueconsidered with respect to the quality of the route update is the age ofthe update, e.g., as determined by the TTL at the time of receipt.

Additional examples of one or more embodiments limiting propagation ofroute updates are discussed below. Returning to the example discussedabove, where router 530D receives route update 590A (e.g., with a roundtrip time of link 580B, determined by a ping of router 530B) from router530A, upon receipt of route update 590A by router 530D, router 530D caneither immediately forward the route update to all adjacent routers(e.g., including back to router 530A), or one or more embodiments candetermine whether route update 590A satisfies one or more criteria fordifferent potential destination routers, e.g., router 530A, and router530C. It should be noted that one condition that can be applied toforwarding route updates is that the route update have a TTL greaterthan zero, e.g., during the TTL of a route update, it is more likely tobe an accurate representation of network conditions, and thus should beforwarded, and after expiration of the TTL, the information may still beuseful to the receiving node, but should not necessarily be forwarded toother nodes.

In addition to determining whether to propagate a route update, andwhether to process route updates 590A-B, TTL can also be used todetermine whether new information received from the route updates 590A-Bshould evict the information about the same network element from routingtable 175. For example, as described in the example above, route update590A can be generated based on a ping of router 530B by router 530A thatmeasures the transmission speed of link 580B.

In one or more embodiments, results of a ping can determine one elementof the potential delay of a path. As described throughout thisdisclosure, the delay of a path (also termed “path delay”) can used forrouting determinations made by a router. Further, routers can exchangepath delays for routes for which information is available to the router,and this communication can facilitate data about links (e.g., routeinformation) of network 500 being available to other routers in network500. In one or more embodiments, when a router sends route informationto another router, the sending router can add the delay of the link usedfor the sending, and thus can provide updated route information forentry into routing table 175.

In this example, route update 590A includes this measurement, and isreceived by router 530D. Upon receipt, in one or more implementations,the TTL of route update 590A can be identified. For example, routeupdate evaluating component 126 determines a TTL of 250 μsec (e.g.,starting TTL of 250 μsec TTL reduced by a 50 μsec transmission time forlink 580A). In this example, because route update 590A arrives at router530D with a positive TTL, this update is accepted for processing byroute update processor 140. In one or more embodiments, TTL can beprecalculated by the transmitting router because, in some embodiments,the transmitter router may be the only source of the example fourelements of delay of the link for which route update 590A isdistributed.

Continuing this example, during processing by route update processor140, a prior value is identified that describes the transmission speedof link 580B. In one or more embodiments, route update processing canthen proceed to compare the quality of the new route information inroute update 590A and the currently stored information. This quality canbe measured in different ways, with one approach being based on thecontent of the update (e.g., a delay based on transmission speed of link580B) discounted by the age of the information, e.g., based on theamount the TTL has been reduced from the starting value (e.g., a TTL of250 μsec). This approach used by one or more embodiments can be based inpart on a concept that a lower delay value for link 580D is of higherquality than a higher delay value for link 580D, without considering theage of the delay values. To incorporate the age of the delay value withthis quality, one or more embodiments can use different mathematicalformulas to discount the quality value by also considering the remainingTTL of the route update.

Thus, based on the forgoing embodiments, in some examples, if an entryin routing table 175 has a delay for link 580B as 20 μsec, but theinformation is 300 μsec old, and a route update 590B is received thatmeasures the link delay at 10 μsec with a TTL of 200 μsec, then theolder, stored value of 20 μsec can be replaced by the new route update590A supplied value of 10 μsec. In other examples, route informationstored in routing table 175 can have been determined more recently thanthe information in route update 590B, and this, combined with the delayinformation, can lead to the opposite result, e.g., the information ofroute update 590B being unused for the updating of routing table 175. Itis worth noting however that, in some circumstances, because of therapid forwarding of route update 590B, and the example TTL of 200 μsecbeing above zero, route update 590B can be forwarded to router 530C,even though it is not used by router 530D. One having skill in therelevant art(s), given the description herein, would appreciate thatthis approaches, along with the approaches used by many other examplefeatures described herein, can combine a goal of rapid propagation ofnetwork updates (e.g., leading to more accurate routing) with apotential for inaccurate results, e.g., based on accurate updates beingunused based on the age of the information. Different parameters havebeen described herein that would enable the implementation and tuning ofone or more embodiments to achieve the results desired.

An example of determining and utilizing authority is illustrated withsome approaches described with FIGS. 4 and 5 above, and network 400 ofFIG. 4 . In an example, source router 420 determines informationcorresponding to a delay between source router 420 and path router 430C,e.g., a delay of link 460D. In this example, route update 490A isgenerated and prepared to be transferred to all routers coupled tosource router 420, e.g., including path router 430A. One way that someembodiments can increase the speed of processing at destination routersis to determine descriptive characteristics for the route updates beforethey are sent.

As described above with FIG. 5 , TTL at the receiving router can beestimated based on the amount of time that has passed from original timeof discovery of the routing information (e.g., 50 μs). In this example,based on a 250 μs maximum TTL, the TTL estimate attached to route update490A is 200 μs, e.g., (250 μs— 50 μs). In one or more embodiments, anestimated delay for a link that propagates the route update 490A can becombined with the determined age route update. For example, in one ormore embodiments, a single value of route update delay can be stored foreach destination network, and this value can be combined with atimestamp to calculate an instantaneous delay to use as described belowto determine an authority of the route update. In this example, fordelivery from source router 420 to path router 430A, routing table 175of source router 420 has an instantaneous delay value of 30 μs for link460A between source router 420 and path router 430A, and this can beused to estimate the delay from propagation of the route update.

Based at least on the age and delay described above, an authority valuefor route update 490A can be determined. In one or more embodiments,this authority value can be determined by source router 420 before thesending of route update 490A to router 430A. This determined authorityvalue can be characterized as an authority value for route update 490Aat the time that route update 490A is estimated to be received by thereceiving router, e.g., path router 430A. In an example implementationusing the example above, authority can have a maximum value (e.g.,1,000,000) that decreases based on the predicted age of the route updatewhen it is received by the destination, e.g., 1,000,000/((MaxTTL−Current TTL)+delay). Thus, in this example, using the 50 μs examplefrom above, the base authority for route update 490A at the time it isprepared for transmission to path router 430A is 20000, e.g.,1,000,000/((250−200)+30). To estimate the authority value at the time ofreceipt by path router 430A, the 170 μs estimated TTL is used from theexample above. Thus, at the time of receipt by path router 430A, theauthority value for route update 490A is 12500, e.g., 1,000,000/((250μs−170 μs)+30 μs). One having skill in the relevant art(s), given thedescription herein, would note the 37.5% reduction in authority based onthe 30 μs instantaneous delay for link 460D. These estimates forauthority and TTL at the time of receipt by path router 430A areincluded with route update 490A.

As noted above, upon receipt by path router 430A, route update 490A canbe compared to an existing value corresponding to the information storedin routing table 175. In an example entry in routing table 175 of pathrouter 430A, an entry for link 460D (e.g., a transmission time fortravel to path router 430C), is 150 μs old at the time of receipt bypath router 430A. In one or more embodiments, authority can bedetermined for this routing table 175 entry at the time route update490A is received. Thus, in this example, the TTL for the routing tableentry is 100 μs, e.g., 250−150. Further, in this example, the authorityvalue determined for the routing table entry is 10,000, e.g.,1,000,000/((250−150)+0 delay). This 10000 can be compared to the 12500authority value of route update 490A, and because the authority value ofroute update 490A exceeds the authority value of the routing tableentry, the information of the route update replaces the routing table175 information for link 460D. In this way, an authority value of aroute update can be characterized as a priority of the route updatecompared to the priorities of other information. It should be notedthat, in one or more embodiments, the authority of entries stored in arouting table can be instantaneously calculated value, e.g., not stored,but calculated at the time the eviction analysis described above occurs.

One having skill in the relevant art(s), given the description herein,would appreciate that the link 460D delay information can be used toupdate any entry in routing table 175 that is based on this link delay.For example, in routing table 175, for path router 430A, an entry for anestimated transmission time to path router 430E can be updated, becausea route to this router travels by link 460D. The example approachdescribed above for determining and utilizing authority values isnon-limiting, and approaches and implementation specifics can beselected, e.g., the scale of the authority value and the rate at whichthe authority value is decreased over time.

Based on the foregoing, it would be apparent to one having skill in therelevant art(s), given the description there that, in someimplementations, it is determined authority, not just a magnitude ofdelay, that can determine the utilization of routing information. Stateddifferently, it can be more advantageous to one or more embodiments touse an update that originated from a close-by source, even if it is notan improvement in delay, than to use an obsolete update from fartheraway that appears to indicate better conditions than the more recentupdate.

FIG. 6 depicts a process whereby the above described processes candefine authority domains with TTL limits on route updates and evaluationby routers receiving the updates, in accordance with one or moreembodiments. For purposes of brevity, description of like elementsand/or processes employed in other embodiments is omitted.

At 630, an update to route information about the network can beidentified. At 640, a TTL value can be determined for the information ofthe route update. At 660, the TTL can be determined to be positive ornot, e.g., zero or negative. When the TTL is determined to be positive,at 670, the route update can be forwarded to other routing devices. Asdescribed with FIG. 2 above, this forwarding of a route update canexpand the authority of the originating router of the route update,e.g., expand the authority domain of the route update to other routingdevices within the network.

When the TTL is determined not to be positive, and after 670 iscompleted (if appropriate), at 680, in an opposite result to 670 abovethe received route update is not forwarded. By not forwarding the routeupdate, one or more embodiments can limit the authority domain of theoriginating router, thus improving, in some circumstances, therelationship between the useful information propagated and theprocessing required to process the information. For example, by limitingthe propagation of the route update (e.g., such as the limiting ofpropagation from path router 430A to path router 430B in the example ofFIG. 4 ), one or more embodiments can reduce the processing (e.g., byrouter 430B) of route information that has a lower likelihood of beingaccurate (e.g., because of age) and relevant (e.g., because of thedistance from the originating router). Stated differently, in one ormore embodiments, route updates can be accepted by routers, even on verylong links, though they can be handled in different ways, based on age,e.g., a cut off in forwarded based on age can be implemented.

One having skill in the relevant art(s), given the description hereinwill appreciate that different parameters (e.g., max TTL, conditionswhere route updates are forwarded, authority determining approaches) canbe adjusted based on the characteristics of different implementationenvironments, including, but not limited to processing power availableat routers, likelihood of error, low latency requirements for networkcommunication.

Continuing this example, at 680, when the route information isdetermined to be better (e.g., have a higher authority) than theinformation stored in the routing table, the route information canreplace the information stored in the routing table. Alternatively, whenthe route information is determined not to be better than theinformation stored in the local routing table, at 675 the routing updatecan be discarded.

FIG. 7 is a flow diagram representing example operations of an examplesystem 700 that can comprise a route update identifying component 125,route update evaluating component 126, and routing table updatingcomponent 128, that can facilitate establishing a domain of authorityfor routing table updates from a routing device, in accordance with oneor more embodiments. For purposes of brevity, description of likeelements and/or processes employed in other embodiments is omitted.

Route update identifying component 125 can be configured 702 tofacilitate identifying a route update that comprises information about anetwork, in accordance with one or more embodiments. For example, in oneor more embodiments, route update identifying component 125 can beconfigured 702 to facilitate identifying a route update that comprisesinformation about a network. Route update flooding component 129 can beconfigured 704 to facilitate communicating, via the network, the routeupdate to a second routing device for propagation of the route update torouting devices in a first authority domain with the first routingdevice, in accordance with one or more embodiments. For example, in oneor more embodiments, route update identifying component 125 can beconfigured 704 to facilitate communicating, via the network, the routeupdate to a second routing device for propagation of the route update torouting devices in a first authority domain with the first routingdevice.

FIG. 8 illustrates a flow diagram of an example method 700 that canfacilitate establishing a domain of authority for routing table updatesfrom a routing device, in accordance with one or more embodiments. Forpurposes of brevity, description of like elements and/or processesemployed in other embodiments is omitted.

At 802, method 800 can comprise facilitating, by a first routing devicecomprising a processor, receiving, from a second routing device via anetwork, a route update that comprises information about a network linkof the network, wherein the route update was identified by the secondrouting device. For example, in one or more embodiments, method 800 cancomprise facilitating, by a first routing device 150 comprising aprocessor 160, receiving (e.g., using route update identifying component125), from a second routing device 180 (e.g., using route updateflooding component 129) via a network 190, a route update 590A thatcomprises information about a network link 580B of network 500, whereinthe route update was identified by the second routing device 530A.

At 804, method 800 can comprise communicating, by the first routingdevice, the route update to routing devices based on inclusion in afirst authority domain with the second routing device, of multipleauthority domains. For example, in one or more embodiments, method 800can comprise communicating, by the first routing device 530A, the routeupdate 590A to routing devices 530D based on inclusion in a firstauthority domain with the second routing device, of multiple authoritydomains.

FIG. 9 illustrates an example block diagram of a mobile handset 900operable to engage in a system architecture that facilitates wirelesscommunications according to one or more embodiments described herein.For purposes of brevity, description of like elements and/or processesemployed in other embodiments is omitted. Although a mobile handset isillustrated herein, it will be understood that other devices can be amobile device, and that the mobile handset is merely illustrated toprovide context for the embodiments of the various embodiments describedherein. The following discussion is intended to provide a brief, generaldescription of an example of a suitable environment in which the variousembodiments can be implemented. While the description includes a generalcontext of computer-executable instructions embodied on amachine-readable storage medium, those skilled in the art will recognizethat the embodiments also can be implemented in combination with otherprogram modules and/or as a combination of hardware and software.

A computing device can typically include a variety of machine-readablemedia. Machine-readable media can be any available media that can beaccessed by the computer and includes both volatile and non-volatilemedia, removable and non-removable media. By way of example and notlimitation, computer-readable media can comprise computer storage mediaand communication media. Computer storage media can include volatileand/or non-volatile media, removable and/or non-removable mediaimplemented in any method or technology for storage of information, suchas computer-readable instructions, data structures, program modules, orother data. Computer storage media can include, but is not limited to,RAM, ROM, EEPROM, flash memory or other memory technology, solid statedrive (SSD) or other solid-state storage technology, Compact Disk ReadOnly Memory (CD ROM), digital video disk (DVD), Blu-ray disk, or otheroptical disk storage, magnetic cassettes, magnetic tape, magnetic diskstorage or other magnetic storage devices, or any other medium which canbe used to store the desired information and which can be accessed bythe computer. In this regard, the terms “tangible” or “non-transitory”herein as applied to storage, memory or computer-readable media, are tobe understood to exclude only propagating transitory signals per se asmodifiers and do not relinquish rights to all standard storage, memoryor computer-readable media that are not only propagating transitorysignals per se.

Communication media typically embodies computer-readable instructions,data structures, program modules, or other data in a modulated datasignal such as a carrier wave or other transport mechanism, and includesany information delivery media. The term “modulated data signal” means asignal that has one or more of its characteristics set or changed insuch a manner as to encode information in the signal. By way of example,and not limitation, communication media includes wired media such as awired network or direct-wired connection, and wireless media such asacoustic, RF, infrared and other wireless media. Combinations of the anyof the above should also be included within the scope ofcomputer-readable media

The handset includes a processor 902 for controlling and processing allonboard operations and functions. A memory 904 interfaces to theprocessor 902 for storage of data and one or more applications 906(e.g., a video player software, user feedback component software, etc.).Other applications can include voice recognition of predetermined voicecommands that facilitate initiation of the user feedback signals. Theapplications 906 can be stored in the memory 904 and/or in a firmware908, and executed by the processor 902 from either or both the memory904 or/and the firmware 908. The firmware 908 can also store startupcode for execution in initializing the handset 900. A communicationscomponent 910 interfaces to the processor 902 to facilitatewired/wireless communication with external systems, e.g., cellularnetworks, VoIP networks, and so on. Here, the communications component910 can also include a suitable cellular transceiver 911 (e.g., a GSMtransceiver) and/or an unlicensed transceiver 913 (e.g., Wi-Fi, WiMax)for corresponding signal communications. The handset 900 can be a devicesuch as a cellular telephone, a PDA with mobile communicationscapabilities, and messaging-centric devices. The communicationscomponent 910 also facilitates communications reception from terrestrialradio networks (e.g., broadcast), digital satellite radio networks, andInternet-based radio services networks.

The handset 900 includes a display 912 for displaying text, images,video, telephony functions (e.g., a Caller ID function), setupfunctions, and for user input. For example, the display 912 can also bereferred to as a “screen” that can accommodate the presentation ofmultimedia content (e.g., music metadata, messages, wallpaper, graphics,etc.). The display 912 can also display videos and can facilitate thegeneration, editing and sharing of video quotes. A serial I/O interface914 is provided in communication with the processor 902 to facilitatewired and/or wireless serial communications (e.g., USB, and/or IEEE1294) through a hardwire connection, and other serial input devices(e.g., a keyboard, keypad, and mouse). This supports updating andtroubleshooting the handset 900, for example. Audio capabilities areprovided with an audio I/O component 916, which can include a speakerfor the output of audio signals related to, for example, indication thatthe user pressed the proper key or key combination to initiate the userfeedback signal. The audio I/O component 916 also facilitates the inputof audio signals through a microphone to record data and/or telephonyvoice data, and for inputting voice signals for telephone conversations.

The handset 900 can include a slot interface 918 for accommodating a SIC(Subscriber Identity Component) in the form factor of a card SubscriberIdentity Module (SIM) or universal SIM 920, and interfacing the SIM card920 with the processor 902. However, it is to be appreciated that theSIM card 920 can be manufactured into the handset 900, and updated bydownloading data and software.

The handset 900 can process IP data traffic through the communicationscomponent 910 to accommodate IP traffic from an IP network such as, forexample, the Internet, a corporate intranet, a home network, a personarea network, etc., through an ISP or broadband cable provider. Thus,VoIP traffic can be utilized by the handset 900 and IP-based multimediacontent can be received in either an encoded or a decoded format.

A video processing component 922 (e.g., a camera) can be provided fordecoding encoded multimedia content. The video processing component 922can aid in facilitating the generation, editing, and sharing of videoquotes. The handset 900 also includes a power source 924 in the form ofbatteries and/or an AC power subsystem, which power source 924 caninterface to an external power system or charging equipment (not shown)by a power I/O component 926.

The handset 900 can also include a video component 930 for processingvideo content received and, for recording and transmitting videocontent. For example, the video component 930 can facilitate thegeneration, editing and sharing of video quotes. A location trackingcomponent 932 facilitates geographically locating the handset 900. Asdescribed hereinabove, this can occur when the user initiates thefeedback signal automatically or manually. A user input component 934facilitates the user initiating the quality feedback signal. The userinput component 934 can also facilitate the generation, editing andsharing of video quotes. The user input component 934 can include suchconventional input device technologies such as a keypad, keyboard,mouse, stylus pen, and/or touch screen, for example.

Referring again to the applications 906, a hysteresis component 936facilitates the analysis and processing of hysteresis data, which isutilized to determine when to associate with the access point. Asoftware trigger component 938 can be provided that facilitatestriggering of the hysteresis component 936 when the Wi-Fi transceiver913 detects the beacon of the access point. A SIP client 940 enables thehandset 900 to support SIP protocols and register the subscriber withthe SIP registrar server. The applications 906 can also include a client942 that provides at least the capability of discovery, play and storeof multimedia content, for example, music.

The handset 900, as indicated above related to the communicationscomponent 910, includes an indoor network radio transceiver 913 (e.g.,Wi-Fi transceiver). This function supports the indoor radio link, suchas IEEE 802.11, for the dual-mode GSM handset 900. The handset 900 canaccommodate at least satellite radio services through a handset that cancombine wireless voice and digital radio chipsets into a single handhelddevice.

One or more devices described herein can be connected to one or morecommunication service provider networks via one or more backhaul linksor the like (not shown). For example, the one or more backhaul links cancomprise wired link components, such as a T1/E1 phone line, a digitalsubscriber line (DSL) (e.g., either synchronous or asynchronous), anasymmetric DSL (ADSL), an optical fiber backbone, a coaxial cable, andthe like.

It should be understood that any of the examples and terms used hereinare non-limiting. For instance, while examples are generally directed tonon-standalone operation where the NR backhaul links are operating onmmWave bands and the control plane links are operating on sub-6 GHz LTEbands, it should be understood that it is straightforward to extend thetechnology described herein to scenarios in which the sub-6 GHz anchorcarrier providing control plane functionality could also be based on NR.As such, any of the examples herein are non-limiting examples, any ofthe embodiments, aspects, concepts, structures, functionalities orexamples described herein are non-limiting, and the technology may beused in various ways that provide benefits and advantages in radiocommunications in general.

One or more embodiments can employ various cellular systems,technologies, and modulation schemes to facilitate wireless radiocommunications between devices. While example embodiments include use of5G new radio (NR) systems, one or more embodiments discussed herein canbe applicable to any radio access technology (RAT) or multi-RAT system,including where user equipment operate using multiple carriers, e.g. LTEFDD/TDD, GSM/GERAN, CDMA2000, etc. For example, a wireless communicationsystem can operate in accordance with global system for mobilecommunications (GSM), universal mobile telecommunications service(UMTS), long term evolution (LTE), LTE frequency division duplexing (LTEFDD, LTE time division duplexing (TDD), high speed packet access (HSPA),code division multiple access (CDMA), wideband CDMA (WCMDA), CDMA2000,time division multiple access (TDMA), frequency division multiple access(FDMA), multi-carrier code division multiple access (MC-CDMA),single-carrier code division multiple access (SC-CDMA), single-carrierFDMA (SC-FDMA), orthogonal frequency division multiplexing (OFDM),discrete Fourier transform spread OFDM (DFT-spread OFDM) single carrierFDMA (SC-FDMA), Filter bank based multi-carrier (FBMC), zero tailDFT-spread-OFDM (ZT DFT-s-OFDM), generalized frequency divisionmultiplexing (GFDM), fixed mobile convergence (FMC), universal fixedmobile convergence (UFMC), unique word OFDM (UW-OFDM), unique wordDFT-spread OFDM (UW DFT-Spread-OFDM), cyclic prefix OFDM CP-OFDM,resource-block-filtered OFDM, Wi Fi, WLAN, WiMax, and the like. However,various features and functionalities of system 100 are particularlydescribed wherein the devices of system 100 are configured tocommunicate wireless signals using one or more multi carrier modulationschemes, wherein data symbols can be transmitted simultaneously overmultiple frequency subcarriers (e.g., OFDM, CP-OFDM, DFT-spread OFMD,UFMC, FMBC, etc.). The embodiments are applicable to single carrier aswell as to multicarrier (MC) or carrier aggregation (CA) operation ofthe user equipment. The term carrier aggregation (CA) is also called(e.g. interchangeably called) “multi-carrier system”, “multi-celloperation”, “multi-carrier operation”, “multi-carrier” transmissionand/or reception. Note that some embodiments are also applicable forMulti RAB (radio bearers) on some carriers (that is data plus speech issimultaneously scheduled).

In various embodiments, the system 100 can be configured to provide andemploy 5G wireless networking features and functionalities. With 5Gnetworks that may use waveforms that split the bandwidth into severalsub bands, different types of services can be accommodated in differentsub bands with the most suitable waveform and numerology, leading toimproved spectrum utilization for 5G networks. Notwithstanding, in themmWave spectrum, the millimeter waves have shorter wavelengths relativeto other communications waves, whereby mmWave signals can experiencesevere path loss, penetration loss, and fading. However, the shorterwavelength at mmWave frequencies also allows more antennas to be packedin the same physical dimension, which allows for large-scale spatialmultiplexing and highly directional beamforming.

Referring now to FIG. 10 , in order to provide additional context forvarious embodiments described herein, FIG. 10 and the followingdiscussion are intended to provide a brief, general description of asuitable computing environment 1000 in which the various embodiments ofthe embodiment described herein can be implemented. While theembodiments have been described above in the general context ofcomputer-executable instructions that can run on one or more computers,those skilled in the art will recognize that the embodiments can be alsoimplemented in combination with other program modules and/or as acombination of hardware and software. For purposes of brevity,description of like elements and/or processes employed in otherembodiments is omitted.

Generally, program modules include routines, programs, components, datastructures, etc., that perform particular tasks or implement particularabstract data types. Moreover, those skilled in the art will appreciatethat the methods can be practiced with other computer systemconfigurations, including single-processor or multiprocessor computersystems, minicomputers, mainframe computers, Internet of Things (IoT)devices, distributed computing systems, as well as personal computers,hand-held computing devices, microprocessor-based or programmableconsumer electronics, and the like, each of which can be operativelycoupled to one or more associated devices.

The illustrated embodiments of the embodiments herein can be alsopracticed in distributed computing environments where certain tasks areperformed by remote processing devices that are linked through acommunications network. In a distributed computing environment, programmodules can be located in both local and remote memory storage devices.

Computing devices typically include a variety of media, which caninclude computer-readable storage media, machine-readable storage media,and/or communications media, which two terms are used herein differentlyfrom one another as follows. Computer-readable storage media ormachine-readable storage media can be any available storage media thatcan be accessed by the computer and includes both volatile andnonvolatile media, removable and non-removable media. By way of example,and not limitation, computer-readable storage media or machine-readablestorage media can be implemented in connection with any method ortechnology for storage of information such as computer-readable ormachine-readable instructions, program modules, structured data orunstructured data.

Computer-readable storage media can include, but are not limited to,random access memory (RAM), read only memory (ROM), electricallyerasable programmable read only memory (EEPROM), flash memory or othermemory technology, compact disk read only memory (CD-ROM), digitalversatile disk (DVD), Blu-ray disc (BD) or other optical disk storage,magnetic cassettes, magnetic tape, magnetic disk storage or othermagnetic storage devices, solid state drives or other solid statestorage devices, or other tangible and/or non-transitory media which canbe used to store desired information. In this regard, the terms“tangible” or “non-transitory” herein as applied to storage, memory orcomputer-readable media, are to be understood to exclude onlypropagating transitory signals per se as modifiers and do not relinquishrights to all standard storage, memory or computer-readable media thatare not only propagating transitory signals per se.

Computer-readable storage media can be accessed by one or more local orremote computing devices, e.g., via access requests, queries or otherdata retrieval protocols, for a variety of operations with respect tothe information stored by the medium. Communications media typicallyembody computer-readable instructions, data structures, program modulesor other structured or unstructured data in a data signal such as amodulated data signal, e.g., a carrier wave or other transportmechanism, and includes any information delivery or transport media. Theterm “modulated data signal” or signals refers to a signal that has oneor more of its characteristics set or changed in such a manner as toencode information in one or more signals. By way of example, and notlimitation, communication media include wired media, such as a wirednetwork or direct-wired connection, and wireless media such as acoustic,RF, infrared and other wireless media.

With reference again to FIG. 10 , the example environment 1000 forimplementing various embodiments of the aspects described hereinincludes a computer 1002, the computer 1002 including a processing unit1004, a system memory 1006 and a system bus 1008. The system bus 1008couples system components including, but not limited to, the systemmemory 1006 to the processing unit 1004. The processing unit 1004 can beany of various commercially available processors. Dual microprocessorsand other multi-processor architectures can also be employed as theprocessing unit 1004.

The system bus 1008 can be any of several types of bus structure thatcan further interconnect to a memory bus (with or without a memorycontroller), a peripheral bus, and a local bus using any of a variety ofcommercially available bus architectures. The system memory 1006includes ROM 1010 and RAM 1012. A basic input/output system (BIOS) canbe stored in a non-volatile memory such as ROM, erasable programmableread only memory (EPROM), EEPROM, which BIOS contains the basic routinesthat help to transfer information between elements within the computer1002, such as during startup. The RAM 1012 can also include a high-speedRAM such as static RAM for caching data.

The computer 1002 further includes an internal hard disk drive (HDD)1014 (e.g., EIDE, SATA), one or more external storage devices 1016(e.g., a magnetic floppy disk drive (FDD) 1016, a memory stick or flashdrive reader, a memory card reader, etc.) and an optical disk drive 1020(e.g., which can read or write from a CD-ROM disc, a DVD, a BD, etc.).While the internal HDD 1014 is illustrated as located within thecomputer 1002, the internal HDD 1014 can also be configured for externaluse in a suitable chassis (not shown). Additionally, while not shown inenvironment 1000, a solid state drive (SSD) could be used in additionto, or in place of, an HDD 1014. The HDD 1014, external storagedevice(s) 1016 and optical disk drive 1020 can be connected to thesystem bus 1008 by an HDD interface 1024, an external storage interface1026 and an optical drive interface 1028, respectively. The interface1024 for external drive implementations can include at least one or bothof Universal Serial Bus (USB) and Institute of Electrical andElectronics Engineers (IEEE) 1394 interface technologies. Other externaldrive connection technologies are within contemplation of theembodiments described herein.

The drives and their associated computer-readable storage media providenonvolatile storage of data, data structures, computer-executableinstructions, and so forth. For the computer 1002, the drives andstorage media accommodate the storage of any data in a suitable digitalformat. Although the description of computer-readable storage mediaabove refers to respective types of storage devices, it should beappreciated by those skilled in the art that other types of storagemedia which are readable by a computer, whether presently existing ordeveloped in the future, could also be used in the example operatingenvironment, and further, that any such storage media can containcomputer-executable instructions for performing the methods describedherein.

A number of program modules can be stored in the drives and RAM 1012,including an operating system 1030, one or more application programs1032, other program modules 1034 and program data 1036. All or portionsof the operating system, applications, modules, and/or data can also becached in the RAM 1012. The systems and methods described herein can beimplemented utilizing various commercially available operating systemsor combinations of operating systems.

Computer 1002 can optionally comprise emulation technologies. Forexample, a hypervisor (not shown) or other intermediary can emulate ahardware environment for operating system 1030, and the emulatedhardware can optionally be different from the hardware illustrated inFIG. 10 . In such an embodiment, operating system 1030 can comprise onevirtual machine (VM) of multiple VMs hosted at computer 1002.Furthermore, operating system 1030 can provide runtime environments,such as the Java runtime environment or the .NET framework, forapplications 1032. Runtime environments are consistent executionenvironments that allow applications 1032 to run on any operating systemthat includes the runtime environment. Similarly, operating system 1030can support containers, and applications 1032 can be in the form ofcontainers, which are lightweight, standalone, executable packages ofsoftware that include, e.g., code, runtime, system tools, systemlibraries and settings for an application.

Further, computer 1002 can be enable with a security module, such as atrusted processing module (TPM). For instance, with a TPM, bootcomponents hash next in time boot components, and wait for a match ofresults to secured values, before loading a next boot component. Thisprocess can take place at any layer in the code execution stack ofcomputer 1002, e.g., applied at the application execution level or atthe operating system (OS) kernel level, thereby enabling security at anylevel of code execution.

A user can enter commands and information into the computer 1002 throughone or more wired/wireless input devices, e.g., a keyboard 1038, a touchscreen 1040, and a pointing device, such as a mouse 1042. Other inputdevices (not shown) can include a microphone, an infrared (IR) remotecontrol, a radio frequency (RF) remote control, or other remote control,a joystick, a virtual reality controller and/or virtual reality headset,a game pad, a stylus pen, an image input device, e.g., camera(s), agesture sensor input device, a vision movement sensor input device, anemotion or facial detection device, a biometric input device, e.g.,fingerprint or iris scanner, or the like. These and other input devicesare often connected to the processing unit 1004 through an input deviceinterface 1044 that can be coupled to the system bus 1008, but can beconnected by other interfaces, such as a parallel port, an IEEE 1394serial port, a game port, a USB port, an IR interface, a BLUETOOTH®interface, etc.

A monitor 1046 or other type of display device can be also connected tothe system bus 1008 via an interface, such as a video adapter 1048. Inaddition to the monitor 1046, a computer typically includes otherperipheral output devices (not shown), such as speakers, printers, etc.

The computer 1002 can operate in a networked environment using logicalconnections via wired and/or wireless communications to one or moreremote computers, such as a remote computer(s) 1050. The remotecomputer(s) 1050 can be a workstation, a server computer, a router, apersonal computer, portable computer, microprocessor-based entertainmentappliance, a peer device or other common network node, and typicallyincludes many or all of the elements described relative to the computer1002, although, for purposes of brevity, only a memory/storage device1052 is illustrated. The logical connections depicted includewired/wireless connectivity to a local area network (LAN) 1054 and/orlarger networks, e.g., WAN 1056. Such LAN and WAN networkingenvironments are commonplace in offices and companies, and facilitateenterprise-wide computer networks, such as intranets, all of which canconnect to a global communications network, e.g., the Internet.

When used in a LAN networking environment, the computer 1002 can beconnected to the local network 1054 through a wired and/or wirelesscommunication network interface or adapter 1058. The adapter 1058 canfacilitate wired or wireless communication to the LAN 1054, which canalso include a wireless access point (AP) disposed thereon forcommunicating with the adapter 1058 in a wireless mode.

When used in a WAN networking environment, the computer 1002 can includea modem 1060 or can be connected to a communications server on the WAN1056 via other means for establishing communications over the WAN 1056,such as by way of the Internet. The modem 1060, which can be internal orexternal and a wired or wireless device, can be connected to the systembus 1008 via the input device interface 1044. In a networkedenvironment, program modules depicted relative to the computer 1002 orportions thereof, can be stored in the remote memory/storage device1052. It will be appreciated that the network connections shown areexample and other means of establishing a communications link betweenthe computers can be used.

When used in either a LAN or WAN networking environment, the computer1002 can access cloud storage systems or other network-based storagesystems in addition to, or in place of, external storage devices 1016 asdescribed above. Generally, a connection between the computer 1002 and acloud storage system can be established over a LAN 1054 or WAN 1056e.g., by the adapter 1058 or modem 1060, respectively. Upon connectingthe computer 1002 to an associated cloud storage system, the externalstorage interface 1026 can, with the aid of the adapter 1058 and/ormodem 1060, manage storage provided by the cloud storage system as itwould other types of external storage. For instance, the externalstorage interface 1026 can be configured to provide access to cloudstorage sources as if those sources were physically connected to thecomputer 1002.

The computer 1002 can be operable to communicate with any wirelessdevices or entities operatively disposed in wireless communication,e.g., a printer, scanner, desktop and/or portable computer, portabledata assistant, communications satellite, any piece of equipment orlocation associated with a wirelessly detectable tag (e.g., a kiosk,news stand, store shelf, etc.), and telephone. This can include WirelessFidelity (Wi-Fi) and BLUETOOTH® wireless technologies. Thus, thecommunication can be a predefined structure as with a conventionalnetwork or simply an ad hoc communication between at least two devices.

The above description of illustrated embodiments of the subjectdisclosure, including what is described in the Abstract, is not intendedto be exhaustive or to limit the disclosed embodiments to the preciseforms disclosed. While specific embodiments and examples are describedherein for illustrative purposes, various modifications are possiblethat are considered within the scope of such embodiments and examples,as those skilled in the relevant art can recognize.

In this regard, while the disclosed subject matter has been described inconnection with various embodiments and corresponding Figures, whereapplicable, it is to be understood that other similar embodiments can beused or modifications and additions can be made to the describedembodiments for performing the same, similar, alternative, or substitutefunction of the disclosed subject matter without deviating therefrom.Therefore, the disclosed subject matter should not be limited to anysingle embodiment described herein, but rather should be construed inbreadth and scope in accordance with the appended claims below.

As it employed in the subject specification, the term “processor” canrefer to substantially any computing processing unit or devicecomprising, but not limited to comprising, single-core processors;single-processors with software multithread execution capability;multi-core processors; multi-core processors with software multithreadexecution capability; multi-core processors with hardware multithreadtechnology; parallel platforms; and parallel platforms with distributedshared memory. Additionally, a processor can refer to an integratedcircuit, an application specific integrated circuit (ASIC), a digitalsignal processor (DSP), a field programmable gate array (FPGA), aprogrammable logic controller (PLC), a complex programmable logic device(CPLD), a discrete gate or transistor logic, discrete hardwarecomponents, or any combination thereof designed to perform the functionsdescribed herein. Processors can exploit nano-scale architectures suchas, but not limited to, molecular and quantum-dot based transistors,switches and gates, in order to optimize space usage or enhanceperformance of user equipment. A processor may also be implemented as acombination of computing processing units.

In the subject specification, terms such as “store,” “storage,” “datastore,” data storage,” “database,” and substantially any otherinformation storage component relevant to operation and functionality ofa component, refer to “memory components,” or entities embodied in a“memory” or components comprising the memory. It will be appreciatedthat the memory components described herein can be either volatilememory or nonvolatile memory, or can include both volatile andnonvolatile memory.

As used in this application, the terms “component,” “system,”“platform,” “layer,” “selector,” “interface,” and the like are intendedto refer to a computer-related entity or an entity related to anoperational apparatus with one or more specific functionalities, whereinthe entity can be either hardware, a combination of hardware andsoftware, software, or software in execution. As an example, a componentmay be, but is not limited to being, a process running on a processor, aprocessor, an object, an executable, a thread of execution, a program,and/or a computer. By way of illustration and not limitation, both anapplication running on a server and the server can be a component. Oneor more components may reside within a process and/or thread ofexecution and a component may be localized on one computer and/ordistributed between two or more computers. In addition, these componentscan execute from various computer readable media, device readablestorage devices, or machine readable media having various datastructures stored thereon. The components may communicate via localand/or remote processes such as in accordance with a signal having oneor more data packets (e.g., data from one component interacting withanother component in a local system, distributed system, and/or across anetwork such as the Internet with other systems via the signal). Asanother example, a component can be an apparatus with specificfunctionality provided by mechanical parts operated by electric orelectronic circuitry, which is operated by a software or firmwareapplication executed by a processor, wherein the processor can beinternal or external to the apparatus and executes at least a part ofthe software or firmware application. As yet another example, acomponent can be an apparatus that provides specific functionalitythrough electronic components without mechanical parts, the electroniccomponents can include a processor therein to execute software orfirmware that confers at least in part the functionality of theelectronic components.

In addition, the term “or” is intended to mean an inclusive “or” ratherthan an exclusive “or.” That is, unless specified otherwise, or clearfrom context, “X employs A or B” is intended to mean any of the naturalinclusive permutations. That is, if X employs A; X employs B; or Xemploys both A and B, then “X employs A or B” is satisfied under any ofthe foregoing instances. Moreover, articles “a” and “an” as used in thesubject specification and annexed drawings should generally be construedto mean “one or more” unless specified otherwise or clear from contextto be directed to a singular form.

Moreover, terms like “user equipment (UE),” “mobile station,” “mobile,”subscriber station,” “subscriber equipment,” “access terminal,”“terminal,” “handset,” and similar terminology, refer to a wirelessdevice utilized by a subscriber or user of a wireless communicationservice to receive or convey data, control, voice, video, sound, gaming,or substantially any data-stream or signaling-stream. The foregoingterms are utilized interchangeably in the subject specification andrelated drawings. Likewise, the terms “network device,” “access point(AP),” “base station,” “NodeB,” “evolved Node B (eNodeB),” “home Node B(HNB),” “home access point (HAP),” “cell device,” “sector,” “cell,” andthe like, are utilized interchangeably in the subject application, andrefer to a wireless network component or appliance that can serve andreceive data, control, voice, video, sound, gaming, or substantially anydata-stream or signaling-stream to and from a set of subscriber stationsor provider enabled devices. Data and signaling streams can includepacketized or frame-based flows.

Additionally, the terms “core-network”, “core”, “core carrier network”,“carrier-side”, or similar terms can refer to components of atelecommunications network that typically provides some or all ofaggregation, authentication, call control and switching, charging,service invocation, or gateways. Aggregation can refer to the highestlevel of aggregation in a service provider network wherein the nextlevel in the hierarchy under the core nodes is the distribution networksand then the edge networks. User equipment do not normally connectdirectly to the core networks of a large service provider but can berouted to the core by way of a switch or radio area network.Authentication can refer to determinations regarding whether the userrequesting a service from the telecom network is authorized to do sowithin this network or not. Call control and switching can referdeterminations related to the future course of a call stream acrosscarrier equipment based on the call signal processing. Charging can berelated to the collation and processing of charging data generated byvarious network nodes. Two common types of charging mechanisms found inpresent day networks can be prepaid charging and postpaid charging.Service invocation can occur based on some explicit action (e.g. calltransfer) or implicitly (e.g., call waiting). It is to be noted thatservice “execution” may or may not be a core network functionality asthird party network/nodes may take part in actual service execution. Agateway can be present in the core network to access other networks.Gateway functionality can be dependent on the type of the interface withanother network.

Furthermore, the terms “user,” “subscriber,” “customer,” “consumer,”“prosumer,” “agent,” and the like are employed interchangeablythroughout the subject specification, unless context warrants particulardistinction(s) among the terms. It should be appreciated that such termscan refer to human entities or automated components (e.g., supportedthrough artificial intelligence, as through a capacity to makeinferences based on complex mathematical formalisms), that can providesimulated vision, sound recognition and so forth.

Aspects, features, or advantages of the subject matter can be exploitedin substantially any, or any, wired, broadcast, wirelesstelecommunication, radio technology or network, or combinations thereof.Non-limiting examples of such technologies or networks include Geocasttechnology; broadcast technologies (e.g., sub-Hz, ELF, VLF, LF, MF, HF,VHF, UHF, SHF, THz broadcasts, etc.); Ethernet; X.25; powerline-typenetworking (e.g., PowerLine AV Ethernet, etc.); femto-cell technology;Wi-Fi; Worldwide Interoperability for Microwave Access (WiMAX); EnhancedGeneral Packet Radio Service (Enhanced GPRS); Third GenerationPartnership Project (3GPP or 3G) Long Term Evolution (LTE); 3GPPUniversal Mobile Telecommunications System (UMTS) or 3GPP UMTS; ThirdGeneration Partnership Project 2 (3GPP2) Ultra Mobile Broadband (UMB);High Speed Packet Access (HSPA); High Speed Downlink Packet Access(HSDPA); High Speed Uplink Packet Access (HSUPA); GSM Enhanced DataRates for GSM Evolution (EDGE) Radio Access Network (RAN) or GERAN; UMTSTerrestrial Radio Access Network (UTRAN); or LTE Advanced.

What has been described above includes examples of systems and methodsillustrative of the disclosed subject matter. It is, of course, notpossible to describe every combination of components or methods herein.One of ordinary skill in the art may recognize that many furthercombinations and permutations of the disclosure are possible.Furthermore, to the extent that the terms “includes,” “has,”“possesses,” and the like are used in the detailed description, claims,appendices and drawings such terms are intended to be inclusive in amanner similar to the term “comprising” as “comprising” is interpretedwhen employed as a transitional word in a claim.

While the various embodiments are susceptible to various modificationsand alternative constructions, certain illustrated implementationsthereof are shown in the drawings and have been described above indetail. It should be understood, however, that there is no intention tolimit the various embodiments to the specific forms disclosed, but onthe contrary, the intention is to cover all modifications, alternativeconstructions, and equivalents falling within the spirit and scope ofthe various embodiments.

In addition to the various implementations described herein, it is to beunderstood that other similar implementations can be used ormodifications and additions can be made to the describedimplementation(s) for performing the same or equivalent function of thecorresponding implementation(s) without deviating therefrom. Stillfurther, multiple processing chips or multiple devices can share theperformance of one or more functions described herein, and similarly,storage can be effected across a plurality of devices. Accordingly, theembodiments are not to be limited to any single implementation, butrather is to be construed in breadth, spirit and scope in accordancewith the appended claims.

What is claimed is:
 1. First routing equipment, comprising: a processor;and a memory that stores executable instructions that, when theexecutable instructions are executed by the processor, facilitateperformance of operations, comprising: identifying a route update thatcomprises information about a network link enabled via a network,identifying a distance traveled by the route update to the first routingequipment from a source of the route update, and based on the distancetraveled by the route update, communicating the route update to at leastsome of second routing equipment, wherein the route update iscommunicated to the at least some of the second routing equipment thatare within a threshold distance of travel from the source of the routeupdate, wherein the threshold distance is set based on a capability ofthe second routing equipment to receive the route update via networklinks of the network from the first routing equipment, within a periodof time.
 2. The first routing equipment of claim 1, wherein theoperations further comprise: based on the distance traveled by the routeupdate, estimating a value of the route update with respect to anability to describe the network link, resulting in an evaluated value ofthe route update, wherein communicating the route update is furtherbased on the evaluated value of the route update.
 3. The first routingequipment of claim 2, wherein estimating the value of the route updatecomprises estimating the value of the route update based on a likelihoodof accurately reflecting a present status of the network link accordingto an accuracy criterion.
 4. The first routing equipment of claim 1,wherein the threshold distance is set further based on respectivecapabilities of receiving communications by respective ones of thesecond routing equipment within a period of time.
 5. The first routingequipment of claim 4, wherein the network comprises third routingequipment that is unable to receive the routing update within the periodof time, and wherein the operations further comprise, communicating theroute update to the third routing equipment.
 6. The first routingequipment of claim 1, wherein the threshold distance is set furtherbased on a speed of signal propagation associated with signalscommunicated via the network link.
 7. The first routing equipment ofclaim 1, wherein communicating the route update to the at least some ofthe second routing equipment comprises communicating the route update tothe at least some of the second routing equipment asynchronously, inresponse to identifying the route update.
 8. The first routing equipmentof claim 1, wherein the threshold distance is set to select a number ofdevices to be used for communication of the route update.
 9. The firstrouting equipment of claim 1, wherein the operations further comprise,updating a routing table of the first routing equipment in accordancewith the route update.
 10. A method, comprising: facilitating, by afirst routing device comprising a processor, receiving, from a secondrouting device via a network, a route update that comprises informationabout a network link of the network; and based on a distance traveled bythe route update from a place of generation of the route update to thefirst routing device, propagating the route update to first routingdevices, wherein the route update is further propagated among the firstrouting devices based on respective distances of travel from thegeneration of the route update to the first routing devices.
 11. Themethod of claim 10, wherein the network comprises second routing devicescomprising the first routing devices, and wherein the distance traveledby the route update determines which of the second routing devices ofthe network are in a defined domain of authority.
 12. The method ofclaim 11, wherein receiving the route update from the second routingdevice comprises receiving the route update synchronously, at a definedtime interval.
 13. The method of claim 12, wherein propagating the routeupdate synchronously is facilitated by the second routing device havingbeen determined to be in the defined domain of authority with the firstrouting device.
 14. The method of claim 11, wherein the second routingdevice is directly coupled to the first routing device in the network,and wherein a third routing device receives the route update based onthe third routing device being determined to be in the defined domain ofauthority with the first routing device.
 15. The method of claim 10,further comprising, propagating, by the first routing device, the routeupdate to a third routing device in a first defined domain of authoritydefined based on propagation via network links of the networkoriginating from the third routing device, within a respective distanceof travel from the generation of the route update to the third routingdevice.
 16. The method of claim 15, wherein the network comprises secondrouting devices comprising the first routing devices, wherein the firstdomain of authority comprises a first group of the second routingdevices that are in a first domain of authority with the first routingdevice, and a second group of the second routing devices that are not inthe first domain of authority with the first routing device.
 17. Anon-transitory machine-readable storage medium comprising executableinstructions that, when executed by a processor of a first routingdevice, facilitate performance of operations, the operations comprising:receiving, from a second routing device via a network, a route updatethat comprises information relating to a network link enabled via thenetwork, wherein the route update was identified by the second routingdevice; and based on a distance traveled by the route update,propagating the route update to a group of routing devices, wherein theroute update is further propagated among the group of routing devices,the group of routing devices having been determined to be within athreshold distance of travel from generation of the route update. 18.The non-transitory machine-readable storage medium of claim 17, whereinthe operations further comprise, based on the distance traveled by theroute update, estimating a value of the route update relating to thenetwork link, resulting in an evaluated value of the route update, andwherein propagating the route update is further based on the evaluatedvalue of the route update.
 19. The non-transitory machine-readablestorage medium of claim 18, wherein the value of the route update isestimated based on a likelihood that a present status the network linkis accurate.
 20. The non-transitory machine-readable storage medium ofclaim 19, wherein the threshold distance is determined based on acapability of receiving communications by first routing devices within aperiod of time.